Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations

نویسندگان

  • Oliver Klein
  • Remco C. Veltkamp
چکیده

The ideas and results contained in this document are part of my thesis, which will be published as a Stanford computer science technical report in June 1999. Similar ideas applied to the EMD under translation have already been published in the technical report [1]. We begin some intuition, examples, and informal definitions. The Earth Mover's Distance (EMD) is a distance measure between discrete, finite distributions Here x has m=2 masses and y has n=3 masses. The circle centers are the points (mass locations) of the distributions. The area of a circle is proportional to the weight at its center point. The total weight of x is w S =sum i=1..m w i , and the total weight of y is u S =sum j=1..n u j. In the example above, the distributions have equal total weight w S =u S =1. Although the EMD does not require equal-weight distributions, let us begin our discussion with this assumption. The EMD between two equal-weight distributions is proportional to the amount of work needed to morph one distribution into the other. We morph x into y by transporting mass from the x mass locations to the y mass locations until x has been rearranged to look exactly like y. An example morph is shown below. The amount of mass transported from x i to y j is denoted f ij , and is called a flow between x i and y j. The work done to transport an amount of mass f ij from x i to y j is the product of the f ij and the distance d ij =d(x i ,y j) between x i and y j. The total amount of work to morph x into y by the flow F=(f ij) is the sum of the individual works: The flow in the previous example is not an optimal flow between the given distributions. A minimum work flow is shown below. The total amount of work done by this flow is 0.23*155.7 + 0.26*277.0 + 0.25*252.3 + 0.26*198.2 = 222.4. The EMD between equal-weight distributions is the minimum work to morph one into the other, divided by the total weight of the distributions. The normalization by the total weight makes the EMD equal to the average distance travelled by mass during an optimal (i.e. work minimizing) flow. The EMD does not change if all the weights in both distributions …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation algorithms for the Earth mover's distance under transformations using reference points

Reference points have been introduced in [2] and [1] to construct approximation algorithms for matching compact subsets of R under a given class of transformations. Also a general discussion of reference point methods for matching according to the Hausdorffdistance has been given in [1]. Another distance measure used for shape matching is the Earth Mover’s Distance (EMD) for weighted point sets...

متن کامل

The Earth Mover's Distance under Transformation Sets

The Earth Mover’s Distance (EMD) is a distance measure between distributions with applications in image retrieval and matching. We consider the problem of computing a transformation of one distribution which minimizes its EMD to another. The applications discussed here include estimation of the size at which a color pattern occurs in an image, lighting-invariant object recognition, and point fe...

متن کامل

Matching point sets with respect to the Earth mover's distance

Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + 6) and (2+6)-approximation algorithms for the minimum Euclidean Earth Mover’s Distance between A and B under translations and rigid motions respectively. In the general case where the sets have unequal total weights the algorithms run in O((nm/6) log(n/6)) time for translations and O((nm/6) log(n/6)) ...

متن کامل

Earth Mover's Distance and Equivalent Metrics for Spaces with Semigroups

introduce a multi-scale metric on a space equipped with a diffusion semigroup. We prove, under some technical conditions, that the norm dual to the space of Lipschitz functions with respect to this metric is equivalent to two other norms, one of which is a weighted sum of the averages at each scale, and one of which is a weighted sum of the difference of averages across scales. The notion of 's...

متن کامل

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005